import java.util.Stack;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 25228
 * Date: 2024-08-03
 * Time: 16:24
 */
public class Solution2 {
    public Solution2(int[] a1, int[] a2) {
    }

    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param pushV int整型一维数组
     * @param popV int整型一维数组
     * @return bool布尔型
     */
    public boolean IsPopOrder (int[] pushV, int[] popV) {
        Stack<Integer> list=new Stack<>();
        int j=0;
        if(popV.length==0){
            return false;
        }
        for (int k : pushV) {
            list.push(k);
            while (!list.isEmpty() && list.peek() == popV[j]) {
                list.pop();
                j++;
            }
        }
        return list.isEmpty();
    }
}
